Diffusion and protection across a random graph
نویسندگان
چکیده
We study the interplay between the diffusion of a harmful state in a network of contacts and the possibility of individual agents to undertake costly investment to protect themselves against infection. We characterize how equilibrium diffusion outcomes, such as immunization rate and total prevalence, respond to changes in the architecture of the network, and show that these responses depend on the details of the diffusion process.
منابع مشابه
LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملOPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES
During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملDiffusion approximation for the components in critical inhomogeneous random graphs of rank 1
Consider the random graph on n vertices 1, . . . , n. Each vertex i is assigned a type Xi with X1, . . . ,Xn being independent identically distributed as a nonnegative discrete random variable X. We assume that EX3 < ∞. Given types of all vertices, an edge exists between vertices i and j independent of anything else and with probability min{1, XiXj n ( 1 + a n1/3 ) }. We study the critical phas...
متن کاملThe University of Chicago Diffusion in Computer Science and Statistics a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science by Hariharan Narayanan
In this thesis, we investigate diffusion as an algorithmic and analytic tool in statistics and computer science. We address a question arising from computational linguistics, where we wish to understand the behavior of a network of agents modeled as nodes of a graph that adaptively modify their lexicon using data from their neighbors. By introducing a model of memory and a family of coalescing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Network Science
دوره 3 شماره
صفحات -
تاریخ انتشار 2015